Poster: Regret Minimizing Audits

نویسندگان

  • Jeremiah Blocki
  • Nicolas Christin
  • Anupam Datta
  • Arunesh Sinha
چکیده

Audits complement access control and are essential for enforcing privacy and security policies in many situations. The importance of audit as an a posteriori enforcement mechanism has been recognized in the computer security literature. For example, Lampson [1] takes the position that audit logs that record relevant evidence during system execution can be used to detect violations of policy, establish accountability and punish the violators. More recently, Weitzner et al. [2] also recognize the importance of audit and accountability, and the inadequacy of preventive access control mechanisms as the sole basis for privacy protection in today’s open information environment. However, unlike access control, which has been the subject of a significant body of foundational work, there is comparatively little work on the foundations of audit. Our focus is on policies that cannot be mechanically enforced in their entirety. Privacy regulations, such as the HIPAA for electronic medical record, provide one set of relevant policies of this form. For example, HIPAA allows transmission of protected health information about an individual from a hospital to a law enforcement agency if the hospital believes that the death of the individual was suspicious. Such beliefs cannot, in general, be checked mechanically either at the time of transmission or in an a posteriori audit; the checking process requires human auditors to inspect evidence recorded on audit logs. In practice, organizations like hospitals use ad hoc audits in conjunction with access control mechanisms to protect patient privacy. Typically, the access control policies are quite permissive: all employees who might need patient information to perform activities related to treatment, payment and operations may be granted access to patient records. These permissive policies are necessary to ensure that no legitimate access request is ever denied, as denying such requests could have adverse consequences on the quality of patient care. Unfortunately, a permissive access control regime opens up the possibility of records being inappropriately accessed and transmitted. Audit mechanisms help detect such violations of policy. This is achieved by recording accesses made by employees in an audit log that is then examined by human auditors to determine whether accesses and transmissions were appropriate and to hold individuals accountable for violating policy. Recent studies reveal that many policy violations occur in the real world as employees inappropriately access records of celebrities and family members motivated by general curiosity, financial gain and other considerations [3]. Thus, there is a pressing need to develop audit mechanisms with well understood properties that effectively detect policy violations. This work presents the first principled learning-theoretic foundation for audits of this form. Our first contribution is a game-theoretic model that captures the interaction between the defender (e.g., hospital auditors) and the adversary (e.g., hospital employees). The model takes pragmatic considerations into account, in particular, the periodic nature of audits, a budget that constrains the number of actions that the defender can inspect thus reflecting the imperfect nature of audit-based enforcement, and a loss function that captures the economic impact of detected and missed violations on the organization. We assume that the adversary is worst-case as is standard in other areas of computer security. We also formulate a desirable property of the audit mechanism in this model based on the concept of regret in learning theory [4]. Our second contribution is a novel audit mechanism that provably minimizes regret for the defender. The mechanism learns from experience and provides operational guidance to the human auditor about which and how many of the accesses to inspect. The regret bound is significantly better than prior results in the learning literature.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regret Minimizing Audits: A Learning-theoretic Basis for Privacy Protection (CMU-CyLab-11-003)

Audit mechanisms are essential for privacy protection in permissive access control regimes, such as in hospitals where denying legitimate access requests can adversely affect patient care. Recognizing this need, we develop a principled approach to audits. Our first contribution is a game-theoretic model that captures the interaction between the defender (e.g., hospital auditors) and the adversa...

متن کامل

Computing optimal k-regret minimizing sets with top-k depth contours

Regret minimizing sets are a very recent approach to representing a dataset D with a small subset S of representative tuples. The set S is chosen such that executing any top-1 query on S rather than D is minimally perceptible to any user. To discover an optimal regret minimizing set of a predetermined cardinality is conjectured to be a hard problem. In this paper, we generalize the problem to t...

متن کامل

Minimizing Regret in Discounted-Sum Games

In this paper, we study the problem of minimizing regret in discounted-sum games played on weighted game graphs. We give algorithms for the general problem of computing the minimal regret of the controller (Eve) as well as several variants depending on which strategies the environment (Adam) is permitted to use. We also consider the problem of synthesizing regret-free strategies for Eve in each...

متن کامل

Efficient Algorithms for k-Regret Minimizing Sets

A regret minimizing set Q is a small size representation of a much larger database P so that user queries executed on Q return answers whose scores are not much worse than those on the full dataset. In particular, a k-regret minimizing set has the property that the regret ratio between the score of the top-1 item in Q and the score of the top-k item in P is minimized, where the score of an item...

متن کامل

Minimizing Regret in Dynamic Decision Problems

The menu-dependent nature of regret-minimization creates subtleties in applying regret-minimization to dynamic decision problems. Firstly, it is not clear whether forgone opportunities should be included in the menu. We explain commonly observed behavioral patterns as minimizing regret when forgone opportunities are present, and also show how the treatment of forgone opportunities affects behav...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011